General Cardinality Genetic Algorithms
نویسندگان
چکیده
A complete generalization of the Vose genetic algorithm model from the binary to higher cardinality case is provided. Boolean AND and EXCLUSIVE-OR operators are replaced by multiplication and addition over rings of integers. Walsh matrices are generalized with finite Fourier transforms for higher cardinality usage. Comparison of results to the binary case are provided.
منابع مشابه
On the Design of Diploid Genetic Algorithms for Problem Optimization in Dynamic Environments [CEC7508]
Using diploidy and dominance is one method to enhance the performance of genetic algorithms in dynamic environments. For diploidy genetic algorithms, there are two key design factors: the cardinality of genotypic alleles and the uncertainty in the dominance scheme. This paper investigates the effect of these two factors on the performance of diploidy genetic algorithms in dynamic environments. ...
متن کاملAn experimental comparison of some heuristics for cardinality constrained bin packing problem
Background: Bin packing is an NP hard optimization problem of packing items of given sizes into minimum number of capacity limited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of items in a bin must not exceed a given limit Nmax. Objectives: Goal of the paper is to present a p...
متن کاملA Greedy Approach for Selection of Residual Generators
This paper considers the problem of selecting a set of residual generators, fulfilling requirements in terms of fault isolability and minimal cardinality, for inclusion in a model-based FDI-system. Two novel algorithms for solving the selection problem are proposed. The first one provides an exact solution fulfilling both requirements and is suitable for small problems. The second one, which is...
متن کاملAn open question on the existence of Gabor frames in general linear position
Uncertainty principles for functions defined on finite Abelian groups generally relate the cardinality of a function to the cardinality of its Fourier transform. We examine how the cardinality of a function is related to the cardinality of its short–time Fourier transform. We illustrate that for some cyclic groups of small order, both, the Fourier and the short–time Fourier case, show a remarka...
متن کاملUnconstrained and Constrained Blackbox Optimization: the Search Perspective
The SEARCH (Search Envisioned As Relation & Class Hierarchizing) framework developed elsewhere (Kargupta, 1995a; Kargupta & Goldberg, 1995) ooered an alternate perspective toward blackbox optimization (BBO)|optimization in presence of little domain knowledge. The SEARCH framework investigates the conditions essential for transcending the limits of random enumerative search using a framework dev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Evolutionary computation
دوره 5 4 شماره
صفحات -
تاریخ انتشار 1997